On Applying Molecular Computation to the Data Encryption Standard
نویسندگان
چکیده
منابع مشابه
On applying molecular computation to the data encryption standard
Recently, Boneh, Dunworth, and Lipton (1996) described the potential use of molecular computation in attacking the United States Data Encryption Standard (DES). Here, we provide a description of such an attack using the sticker model of molecular computation. Our analysis suggests that such an attack might be mounted on a tabletop machine using approximately a gram of DNA and might succeed even...
متن کاملThe Data Encryption Standard (DES)
The Data Encryption Standard (DES) [31] has been around for more than 25 years. DES was an outcome of a call for primitives in 1974 which didn’t result in many serious candidates except for a predecessor of DES, Lucifer [15, 35] designed by IBM around 1971. It took another year for a joint IBM–NSA effort to turn Lucifer into DES. The structure of Lucifer was significantly altered and since the ...
متن کاملData Encryption Standard
In 1972, the NBS Institute for Computer Sciences and Technology (ICST) initiated a project in computer security, a subject then in its infancy. One of the first goals of the project was to develop a cryptographic algorithm standard that could be used to protect sensitive and valuable data during transmission and in storage. Prior to this NBS initiative, encryption had been largely the concern o...
متن کاملImplementation of Enhanced Data Encryption Standard on MANET with less energy consumption through limited computation
– A mobile ad hoc network (MANET) is a self-organizing system of mobile nodes. The nodes in MANET are free to move arbitrarily. The nature of the mobile ad hoc networks (MANETs) makes them very vulnerable to an adversary’s security threats. Providing security through cryptographic algorithms in these networks is very important. To provide an information security in MANET symmetric encryption al...
متن کاملThe Data Encryption Standard ( DES ) and its
Table 6: The best orders of the S-boxes (p = 2 ?48). 6 Appendix This appendix describes 136 orders of DES S-boxes for which the maximal probability of two-round iterative characteristics is as in DES or smaller. Table 6 describes the orders whose best characteristics have probability 2 ?48 , which is lower than the best characteristic of DES. Table 7 describes the orders whose best characterist...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Biology
سال: 1999
ISSN: 1066-5277,1557-8666
DOI: 10.1089/cmb.1999.6.53